Dynamic Modal Predicate Logic
نویسنده
چکیده
منابع مشابه
Modal Kleene Algebra and Applications — A Survey —
Modal Kleene algebras are Kleene algebras with forward and backward modal operators, defined via domain and codomain operations. They provide a concise and convenient algebraic framework that subsumes various popular calculi and allows treating quite a number of areas. We survey the basic theory and some prominent applications. These include, on the system semantics side, wlp and wp calculus, P...
متن کاملModal Foundations for Predicate Logic
The complexity of any logical modeling reeects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigatèlighter' versions of this general purpose tool, by modally`deconstructing' the usual semantics, and locating i...
متن کاملModal Kleene Algebra and Partial Correctness
We enrich Kleene algebra by domain and codomain operators. These abstractions of relational notions give rise to four modal operators. The boxes and diamonds enjoy various symmetries via Galois connections and dualities. Lifting modal statements to modal operator semirings yields a further abstraction and thus a more elegant and concise “statefree” reasoning about modalities. We use this modal ...
متن کاملThe Semantics of Modal Predicate Logic I. Counterpart-Frames
We introduce a new semantics for modal predicate logic, with respect to which a rich class of first-order modal logics is complete, namely all normal first-order modal logics that are extensions of free quantified K. This logic is defined by combining positive free logic with equality PFL . = and the propositional modal logic K. We then uniformly construct—for each modal predicate logic L—a can...
متن کاملA Logic for Abstract State Machines
We introduce a logic for non distributed, deterministic Abstract State Machines with parallel function updates. Unlike other logics for ASMs which are based on dynamic logic, our logic is based on an atomic predicate for function updates and on a definedness predicate for the termination of the evaluation of transition rules. We do not assume that the transition rules of ASMs are in normal form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994